منابع مشابه
Constrained Markov Games: Nash Equilibria
In this paper we develop the theory of constrained Markov games. We consider the expected average cost as well as discounted cost. We allow diierent players to have different types of costs. We present suucient conditions for the existence of stationary Nash equilibrium. Our results are based on the theory of sensitivity analysis of mathematical programs developed by Dantzig, Folkman and Shapir...
متن کاملComputing Constrained Approximate Equilibria in Polymatrix Games
This paper is about computing constrained approximate Nash equilibria in polymatrix games, which are succinctly represented manyplayer games defined by an interaction graph between the players. In a recent breakthrough, Rubinstein showed that there exists a small constant ǫ, such that it is PPAD-complete to find an (unconstrained) ǫ-Nash equilibrium of a polymatrix game. In the first part of th...
متن کاملConstrained Optimization for Liquid Crystal Equilibria
This paper compares the performance of penalty and Lagrange multiplier approaches for the necessary unit-length constraint in the computation of liquid crystal equilibrium configurations. Building on previous work in [SIAM J. Sci. Comput., 37 (2015), pp. S157–S176; SIAM J. Numer. Anal., 53 (2015), pp. 2226–2254], the penalty method is derived and well-posedness of the linearizations within the ...
متن کاملConstrained Pure Nash Equilibria in Polymatrix Games
We study the problem of checking for the existence of constrained pure Nash equilibria in a subclass of polymatrix games defined on weighted directed graphs. The payoff of a player is defined as the sum of nonnegative rational weights on incoming edges from players who picked the same strategy augmented by a fixed integer bonus for picking a given strategy. These games capture the idea of coord...
متن کاملConstrained Pure Nash Equilibria in Graphical Games
The rational behavior of non-cooperative players is often formalized by means of the game theoretic notion of Nash equilibrium. However, there are several practical applications (e.g., multiagent planning, mechanism design, and routing protocols design), where the computation of any Nash equilibrium could not be satisfactory, since we are often interested only in equilibria that satisfy some ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2002
ISSN: 1556-5068
DOI: 10.2139/ssrn.319222